CHOICE-SEQUENCE PATTERNS IN BINARY-CHOICE “LEARNING” BY RETARDATES1,2
نویسندگان
چکیده
منابع مشابه
Instance-based Learning: A General Model of Repeated Binary Choice
A common practice in cognitive modeling is to develop new models specific to each particular task. We question this approach and draw on an existing theory, instance-based learning theory (IBLT), to explain learning behavior in three different choice tasks. The same instance-based learning model generalizes accurately to choices in a repeated binary choice task, in a probability learning task, ...
متن کاملNONPARAMETRIC ESTIMATION IN RANDOM COEFFICIENTS BINARY CHOICE MODELS By
This paper considers random coefficients binary choice models. The main goal is to estimate the density of the random coefficients nonparametrically. This is an ill-posed inverse problem characterized by an integral transform. A new density estimator for the random coefficients is developed, utilizing Fourier-Laplace series on spheres. This approach offers a clear insight on the identification ...
متن کاملMisspecification and Heterogeneity in Binary Choice Models
We address function misspecification and model heterogeneity, two critical issues in empirical work. A nonparametric approach is proposed for single-index, binary-choice models when parametric models such as Probit and Logit are potentially misspecified. The new approach involves two steps: first, we estimate index coefficients using sliced inverse regression without knowing the conditional pro...
متن کاملIntegrated Time Series in Binary Choice Models
Though binary choice and multiple choice models have been a popular tool of microeconometrics for many years, there are macroeconomic time series that are connected with discrete decisions of authorities. Therefore it is very important to develop an appropriate tool for statistical inference for such macroeconomic time series. Macroeconomic continuous time series may be stationary as well as in...
متن کاملLearning by Choice of Internal Representations
We introduce a learning algorithm for multilayer neural networks composed of binary linear threshold elements. Whereas existing algorithms reduce the learning process to minimizing a cost function over the weights, our method treats the internal representations as the fundamental entities to be determined. Once a correct set of internal representations is arrived at, the weights are found by th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ETS Research Bulletin Series
سال: 1964
ISSN: 0424-6144
DOI: 10.1002/j.2333-8504.1964.tb00324.x